Rotate Array

Problem page:https://leetcode.com/problems/rotate-array

Solution

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        k = k % len(nums)
        nums[:] = nums[-k:] + nums[:-k]
        return nums

Complexity

• time: O(n)
• space: O(n)